|
In the mathematical field of graph theory, the F26A graph is a symmetric bipartite cubic graph with 26 vertices and 39 edges. It has chromatic number 2, chromatic index 3, diameter 5, radius 5 and girth 6.〔Conder, M. and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41–63, 2002.〕 It is also a 3-vertex-connected and 3-edge-connected graph. The F26A graph is Hamiltonian and can be described by the LCF notation ()13. ==Algebraic properties== The automorphism group of the F26A graph is a group of order 78.〔Royle, G. (F026A data )〕 It acts transitively on the vertices, on the edges, and on the arcs of the graph. Therefore the F26A graph is a symmetric graph (though not distance transitive). It has automorphisms that take any vertex to any other vertex and any edge to any other edge. According to the Foster census, the F26A graph is the only cubic symmetric graph on 26 vertices.〔 It is also a Cayley graph for the dihedral group ''D''26, generated by ''a'', ''ab'', and ''ab''4, where:〔(Yan-Quan Feng and Jin Ho Kwak, ''Cubic s-Regular Graphs'', p. 67. )〕 : The F26A graph is the smallest cubic graph where the automorphism group acts regularly on arcs (that is, on edges considered as having a direction).〔Yan-Quan Feng and Jin Ho Kwak, "One-regular cubic graphs of order a small number times a prime or a prime square," ''J. Aust. Math. Soc.'' 76 (2004), 345-356 ().〕 The characteristic polynomial of the F26A graph is equal to : 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「F26A graph」の詳細全文を読む スポンサード リンク
|